Fast generation of 2-D node distributions for mesh-free PDE discretizations

نویسندگان

  • Bengt Fornberg
  • Natasha Flyer
چکیده

Many applications require that nodes be scattered locally quasi-uniformly within 2-D regions or on curved surfaces in 3-D space, while obeying some prescribed spatially varying density function. This study focuses on creating variable density node layouts that are suitable for meshfree discretizations of PDEs. Another application is ‘dithering’ to simulate half-tone images. The method is an ’advancing-front type’ scheme, inspired by the physical process of dropping of variable sized grains into a bucket.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

M-estimators as GMM for Stable Laws Discretizations

This paper is devoted to "Some Discrete Distributions Generated by Standard Stable Densities" (in short, Discrete Stable Densities). The large-sample properties of M-estimators as obtained by the "Generalized Method of Moments" (GMM) are discussed for such distributions. Some corollaries are proposed. Moreover, using the respective results we demonstrate the large-sample pro...

متن کامل

A FAST MESH-FREE GALERKIN METHOD FOR THE ANALYSIS OF STEADY-STATE HEAT TRANSFER

The element-free Galerkin method is employed for two-dimensional analysis of steady-state heat transfer. The unknown response of the system, i.e. temperature is approximated using the moving least squares technique. Numerical integration of governing simultaneous system of equations is performed by Gauss quadrature and new modified nodal integration techniques. Numerical examples and tests have...

متن کامل

Properties of Divergence - Free Kernel Methods for Approximation and Solution of Partial Differential Equations by Arthur Araujo

Divergence-free vector field interpolants properties are explored on uniform and scattered nodes, and also their application to fluid flow problems. These interpolants may be applied to physical problems that require the approximant to have zero divergence, such as the velocity field in the incompressible Navier-Stokes equations and the magnetic and electric fields in the Maxwell’s equations. I...

متن کامل

A Node Reconnection Algorithm for Mimetic Finite Difference Discretizations of Elliptic Equations on Triangular Meshes

Most efficient adaptive mesh methods employ only a few strategies, including local mesh refinement (h-adaptation), movement of mesh nodes (r-adaptation), and node reconnection (c-adaptation). Despite of its simplicity, node reconnection is the least popular of the three. However, using only node reconnection the discretization error can be significantly reduced. In this paper, we develop and nu...

متن کامل

A mesh generation procedure to simulate bimaterials

It is difficult to develop an algorithm which is able to generate the appropriate mesh around the interfaces in bimaterials. In this study, a corresponding algorithm is proposed for this class of unified structures made from different materials with arbitrary shapes. The non-uniform mesh is generated adaptively based on advancing front technique available in Abaqus software. Implementing severa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computers & Mathematics with Applications

دوره 69  شماره 

صفحات  -

تاریخ انتشار 2015